GARBAGE-MONGERS.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Just Garbage

up decisions in­ politics. Institu­ tional discrimination e . ts in every social arena, in­ cluding environmental de . . on making. Burdens and benefits are not randomly d ·buted. Reliance solely on "objectiVe" science for e 'ronmental decision making-in a world shaped larg by power politics and special interests-often mas . titurtonal rac­ ism. For example, the assignment of" ptable" risk and ...

متن کامل

SIGPLAN ACM Garbage In / Garbage Out March Möbius

Algorithms for extracting the roots of polynomials of the 2nd, 3rd and 4th degree are usually presented as cookbook recipes, with no insight about how such a recipe works or how it might have been discovered. This note shows how a clever high school student could use transformations (translation, scaling, rotation, inversion) of the complex plane to discover root-extraction methods for these po...

متن کامل

Leveled Garbage Collection

Generational garbage collection (GGC) is one of the most popular garbage collection techniques. GGC gains a performance advantage by performing minor collections on the younger objects in the heap, reducing the number of major collections of the whole heap. A promotion policy determines when an object moves from the younger generation to the older. The design of GGC has been justified by the pl...

متن کامل

Garbage Collection Techniques*

In the execution of logic programming languages, a logic variable can have only one value during its existence, after its instantiation it cannot be changed. Therefore, new values cannot be stored in the same memory cell which property is natural in imperative languages. For similar reasons, a data structure is always copied when a small modification is required. Because of it, memory consumpti...

متن کامل

Skew-space garbage collection

Semispace garbage collectors relocate all the live objects in one step, which is simple and leads to good performance. Compared with mark-compact collectors, however, they need to reserve extra heap space for copying live objects. As much as half of the heap could be reserved as it is possible that all the allocated objects survive. In reality, however, most programs exhibit a high infant morta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Lancet

سال: 1899

ISSN: 0140-6736

DOI: 10.1016/s0140-6736(01)50378-5